Mechanism Design for Federated Sponsored Search Auctions
نویسندگان
چکیده
Recently there is an increase in smaller, domain–specific search engines that scour the deep web finding information that general–purpose engines are unable to discover. These search engines play a crucial role in the new generation of search paradigms where federated search engines (FSEs) integrate search results from heterogeneous sources. In this paper we pose, for the first time, the problem to design a revenue mechanism that ensures profits both to individual search engines and FSEs as a mechanism design problem. To this end, we extend the sponsored search auction models and we discuss possibility and impossibility results on the implementation of an incentive compatible mechanism. Specifically, we develop an execution–contingent VCG (where payments depend on the observed click behavior) that satisfies both individual rationality and weak budget balance in expectation.
منابع مشابه
Designing sponsored search auctions for federated domain-specific search engines
My Ph.D. thesis focuses on the design of economic mechanisms inspired by sponsored search auctions to support new generation search engines. These engines (called integrators) are based on multi-domain queries and on the federation of multiple domain-specific search engines. The problem studied in my thesis is essentially a mechanism design problem where two levels are present: in the first, th...
متن کاملMerging multiple information sources in federated sponsored search auctions
The recent increase of domain–specific search engines, able to discover information unknown by general–purpose search engines, leads to their federation into a single entity, called federated search engine. In this paper, we focus on how it can effectively merge sponsored search results, provided by the domain–specific search engines, into a unique list. In particular, we discuss the case in wh...
متن کاملMechanism Design for Sponsored Search Auctions
The sponsored search auction problem was introduced briefly as an example in Chapter 1. In this chapter, we study this problem in more detail to illustrate a compelling application of mechanism design. We first describe a framework to model this problem as a mechanism design problem under a reasonable set of assumptions. Using this framework, we describe three well known mechanisms for sponsore...
متن کاملSponsored search auctions: an overview of research with emphasis on game theoretic aspects
We provide an overview of recent research that has been conducted on the design of sponsored search auctions. We mainly focus on game theoretic and mechanism design aspects of these auctions, and we analyze the issues associated with each of the three participating entities, i.e. the search engine, the advertisers, and the users of the search engine, as well as their resulting behavior. Regardi...
متن کاملSimplified mechanisms with an application to sponsored-search auctions
Simplified Mechanisms with an Application to Sponsored-Search Auctions Paul Milgrom First draft: August 16, 2007 This draft: December 17, 2008 A mechanism can be simplified by restricting its message space. If the restricted message spaces satisfy a certain “outcome closure property,” then the simplification is “tight”: for every , any Nash equilibrium of the simplified mechanism is also an Nas...
متن کامل